SUM OF DIVISORS FUNCTION
نویسندگان
چکیده
We show that the recurrence relation deduced by Robbins and Osler et al for sum of divisors function can be solved in terms complete Bell polynomials. Besides, connection between number representations n as four triangular numbers allows obtain arecurrence where only participate values with m odd.
منابع مشابه
Iterating the Sum-of-Divisors Function
1991 Mathematics Subject Classi cation: 11A25, 11Y70 Let 0(n) = n and m(n) = ( m 1(n)), where m 1 and is the sum-of-divisors function. We say that n is (m; k)perfect if m(n) = kn. We have tabulated all (2; k)-perfect numbers up to 109 and all (3; k)and (4; k)-perfect numbers up to 2 108. These tables have suggested several conjectures, some of which we prove here. We ask in particular: For any ...
متن کاملRemarks on fibers of the sum-of-divisors function
Let σ denote the usual sum-of-divisors function. We show that every positive real number can be approximated arbitrarily closely by a fraction m/n with σ(m) = σ(n). This answers in the affirmative a question of Erdős. We also show that for almost all of the elements v of σ(N), the members of the fiber σ−1(v) all share the same largest prime factor. We describe an application of the second resul...
متن کاملThe range of the sum-of-proper-divisors function
Answering a question of Erdős, we show that a positive proportion of even numbers are in the form s(n), where s(n) = σ(n) − n, the sum of proper divisors of n.
متن کاملSome Problems of Erdős on the Sum-of-divisors Function
Let σ(n) denote the sum of all of the positive divisors of n, and let s(n) = σ(n)− n denote the sum of the proper divisors of n. The functions σ(·) and s(·) were favorite subjects of investigation by the late Paul Erdős. Here we revisit three themes from Erdős’s work on these functions. First, we improve the upper and lower bounds for the counting function of numbers n with n deficient but s(n)...
متن کاملOn the Number of Prime Factors of Values of the Sum-of-proper-divisors Function
Let ω(n) (resp. Ω(n)) denote the number of prime divisors (resp. with multiplicity) of a natural number n. In 1917, Hardy and Ramanujan proved that the normal order of ω(n) is log log n, and the same is true of Ω(n); roughly speaking, a typical natural number n has about log log n prime factors. We prove a similar result for ω(s(n)), where s(n) denotes the sum of the proper divisors of n: For a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of mathematics and computer research
سال: 2023
ISSN: ['2320-7167']
DOI: https://doi.org/10.47191/ijmcr/v11i7.06